A packing integer program arising in two-layer network design
نویسندگان
چکیده
In this paper we study a certain cardinality constrained packing integer program which is motivated by the problem of dimensioning a cut in a two-layer network. We prove NP-hardness and consider the facial structure of the corresponding polytope. We provide a complete description for the smallest nontrivial case and develop two general classes of facet-defining inequalities. This approach extends the notion of the well known cutset inequalities to two network layers.
منابع مشابه
Developing a cross-docking network design model under uncertain environment
Cross-docking is a logistic concept, which plays an important role in supply chain management by decreasing inventory holding, order packing, transportation costs and delivery time. Paying attention to these concerns, and importance of the congestion in cross docks, we present a mixed-integer model to optimize the location and design of cross docks at the same time to minimize the total transpo...
متن کاملThe Steiner tree packing problem in VLSI design
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switch-box routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we deve...
متن کاملSingle-layer Cuts for Multi-layer Network Design Problems
We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation that takes many practical side constraints into account, including node har...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملA Multi-objective Hierarchical Location-allocation Model for the Healthcare Network Design Considering a Referral System
This paper presents a multi-objective and multi-service location-allocation model with capacity planning to design a healthcare facilities network through considering a referral system. Therefore, a mixed integer nonlinear programming (MINLP) model containing two objective functions is proposed. The first objective function is relates to minimization of total opening cost, minimization of tota...
متن کامل